Constraint and Integer Programming in OPL

نویسنده

  • Pascal Van Hentenryck
چکیده

In recent years, it has been increasingly recognized that constraint and integer programming have orthogonal and complementary strengths in stating and solving combinatorial optimization applications. In addition, their integration has become an active research topic. The optimization programming language opl was a first attempt at integrating these technologies both at the language and at the solver levels. In particular, opl is a modeling language integrating the rich language of constraint programming and the ability to specify search procedures at a high level of abstraction. Its implementation includes both constraint and mathematical programming solvers, as well as some cooperation schemes to make them collaborate on a given problem. The purpose of this paper is to illustrate, using opl, the constraint-programming approach to combinatorial optimization and the complementary strengths of constraint and integer programming. (Artificial Intelligence; Computer Science; Integer Programming )

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatable High-Level Integration of Constraint Programs

We propose a reformulation algorithm as well as a set of re-formulation rules for models of constraint satisfaction problems written in our high-level constraint programming language esra, which is more expressive than opl and is compiled into opl. For the class of mapping problems, the reformulation algorithm achieves models that integrate a constraint programming formulation and an integer pr...

متن کامل

Solving Frequency Assignment Problems with Constraint Programming

The topic of this diploma thesis is the solving of a Frequency Assignment Problem (FAP) in GSM radio networks by means of Constraint Programming. The task of frequency planning is the assignment of frequencies to base stations w.r.t. various constraints such that interference, which may have a substantial impact on the quality of the received signals, is avoided as far as possible. Constraint P...

متن کامل

Comparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints

The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...

متن کامل

High-Level Reformulation of Constraint Programs

We propose a set of reformulation rules for models of constraint satisfaction problems that are written in our high-level constraint programming language ESRA, which is more expressive than OPL and is compiled into OPL. These automatable rules achieve models that are often very similar to what a human modeller would have tried, such as switching from a pure constraint program to an integer line...

متن کامل

Airport Gate Assignment A Hybrid Model and Implementation

With the rapid development of airlines, airports today become much busier and more complicated than previous days. During airlines daily operations, assigning the available gates to the arriving aircrafts based on the fixed schedule is a very important issue, which motivates researchers to study and solve Airport Gate Assignment Problems (AGAP) with all kinds of state-of-the-art combinatorial o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • INFORMS Journal on Computing

دوره 14  شماره 

صفحات  -

تاریخ انتشار 2002